state transition models

state transition models
Программирование: модели переходов состояний

Универсальный англо-русский словарь. . 2011.

Игры ⚽ Поможем сделать НИР

Смотреть что такое "state transition models" в других словарях:

  • Models of DNA evolution — A number of different Markov models of DNA sequence evolution have been proposed. These substitution models differ in terms of the parameters used to describe the rates at which one nucleotide replaces another during evolution. These models are… …   Wikipedia

  • Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… …   Wikipedia

  • Transition constraint — A transition constraint is a way of enforcing that the data doesn t enter an impossible state because of a previous state. For example, it shouldn t be possible for a person to change from being married to being single, never married . The only… …   Wikipedia

  • Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… …   Wikipedia

  • Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… …   Wikipedia

  • Nondeterministic finite-state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes …   Wikipedia

  • Dependability state model — A dependability state diagram is a method for modelling a system as a Markov chain. It is used in reliability engineering for availability and reliability analysis.[1]. A simple state model with two states It consists of creating a finite state… …   Wikipedia

  • Abstract state machines — In computer science, an abstract state machine (ASM) is a state machine in which the number of states need not be finite and in which the states are not mere points in the state space. More precisely, an ASM state is a structure in the sense of… …   Wikipedia

  • Compartmental models in epidemiology — In order to model the progress of an epidemic in a large population, comprising many different individuals in various fields, the population diversity must be reduced to a few key characteristics which are relevant to the infection under… …   Wikipedia

  • Glass transition — The liquid glass transition (or glass transition for short) is the reversible transition in amorphous materials (or in amorphous regions within semicrystalline materials) from a hard and relatively brittle state into a molten or rubber like state …   Wikipedia

  • Phase transition — This diagram shows the nomenclature for the different phase transitions. A phase transition is the transformation of a thermodynamic system from one phase or state of matter to another. A phase of a thermodynamic system and the states of matter… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»